Recovering an Homogeneous Polynomial from Moments of Its Level Set

Recovering an Homogeneous Polynomial from Moments of Its Level Set

A note on recovering the distributions from exponential moments

The problem of recovering a cumulative distribution function of a positive random variable via the scaled Laplace transform inversion is studied. The uniform upper bound of proposed approximation is derived. The approximation of a compound Poisson distribution as well as the estimation of a distribution function of the summands given the sample from a compound Poisson distribution are investiga...

Recovering High-Level Conditions from Binary Programs

The need to get confidence in binary programs without access to their source code has pushed efforts forward to directly analyze executable programs. However, low-level programs lack high-level structures (such as types, control-flow graph, etc.), preventing the straightforward application of sourcecode analysis techniques. Especially, conditional jumps rely on low-level flag predicates, wherea...

An Improved Algorithm for Recovering Exact Value from its Approximation

Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. A bridge overriding the gap was built by Zhang, in which an exact rational number is recovered from its approximation by con...

On the reconstruction of an image from its moments

An image can be seen as an element of a vector space so that it can be expressed in terms of a series expansion of any non necessarily orthogonal base of this space. This paper shows how a matrix-based formulation of this fact permits deriving a new reconstruction method of an image from its geometric moments where the basis functions used in the reconstruction and those used to obtain the mome...